Cluster robustness of preconditioned gradient subspace iteration eigensolvers
نویسندگان
چکیده
منابع مشابه
Convergence Estimates for Preconditioned Gradient Subspace Iteration Eigensolvers
Subspace iteration for computing several eigenpairs (i.e. eigenvalues and eigenvectors) of an eigenvalue problem is an alternative to the deflation technique whereby the eigenpairs are computed successively by projecting the problem onto the subspace orthogonal to the already found eigenvectors. The main advantage of the subspace iteration over the deflation is its ‘cluster robustness’: even if...
متن کاملGradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers
Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver— the gradient iterative method with a fixed step size—for symmetric generalized eigenvalue problems, where we use the gradient of the Rayleigh quotient as an optimization direction. A sharp convergence rate bound fo...
متن کاملPreconditioned Eigensolvers—an Oxymoron?
A short survey of some results on preconditioned iterative methods for symmetric eigenvalue problems is presented. The survey is by no means complete and reflects the author’s personal interests and biases, with emphasis on author’s own contributions. The author surveys most of the important theoretical results and ideas which have appeared in the Soviet literature, adding references to work pu...
متن کاملInexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
An important variation of preconditioned conjugate gradient algorithms is inexact precon-ditioner implemented with inner-outer iterations 5], where the preconditioner is solved by an inner iteration to a prescribed precision. In this paper, we formulate an inexact preconditioned conjugate gradient algorithm for a symmetric positive deenite system and analyze its convergence property. We establi...
متن کاملSuperoptimal Preconditioned Conjugate Gradient Iteration for Image Deblurring
We study the superoptimal Frobenius operators in the two-level circulant algebra. We consider two specific viewpoints: (1) the regularizing properties in imaging and (2) the computational effort in connection with the preconditioned conjugate gradient method. Some numerical experiments illustrating the effectiveness of the proposed technique are given and discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.06.039